- recursive graph
- 递归图
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
recursive graph
Look at other dictionaries:
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Recursive tree — In graph theory, a discipline within mathematics, a recursive tree is a non planar labeled rooted tree. A size n recursive tree is labeled by distinct integers 1, 2, ..., n , where the labels are strictly increasing starting at the root labeled 1 … Wikipedia
Recursive transition network — A recursive transition network ( RTN ) is a graph theoretical schematic used to represent the rules of a context free grammar. RTNs have application to programming languages, natural language and lexical analysis. Any sentence that is constructed … Wikipedia
Recursive XY-cut — The recursive X Y cut is a top down page segmentation technique that decomposes a document image recursively into a set of rectangular blocks.The algorithm works by projecting the document bitmap (i.e. summing up all the pixels in a line) to the… … Wikipedia
List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 … Wikipedia
Chordal graph — A cycle (black) with two chords (green). As for this part, the graph is chordal. However, removing one green edge would result in a non chordal graph. Indeed, the other green edge with three black edges would form a cycle of length four with no… … Wikipedia
Tanner graph — A Tanner graph is a bipartite graph used to specify constraints or equations which specify error correcting codes. In coding theory, Tanner graphs are used to construct longer codes from smaller ones. Both encoders and decoders employ these… … Wikipedia
Neighbourhood (graph theory) — A graph consisting of 6 vertices and 7 edges For other meanings of neighbourhoods in mathematics, see Neighbourhood (mathematics). For non mathematical neighbourhoods, see Neighbourhood (disambiguation). In graph theory, an adjacent vertex of a… … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Call graph — A call graph (also known as a call multigraph) is a directed graph that represents calling relationships between subroutines in a computer program. Specifically, each node represents a procedure and each edge (f,g) indicates that procedure f… … Wikipedia
E-graph — Un E Graph en informatique est une structure de donnée servant à déterminer si une égalité peut être la conséquence de plusieurs autres égalités, et ceci de manière purement syntaxique. On considère un ensemble d égalité sur des termes sur un… … Wikipédia en Français
